The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels
نویسندگان
چکیده
منابع مشابه
The capacity of Abelian group codes over symmetric channels
In this paper the capacity achievable by Abelian group codes when employed over symmetric channels is determined. For certain important examples, like the AWGN channel with m-PSK modulation, it follows that this capacity coincides with the corresponding Shannon capacity of these channels. In other words using Abelian group codes in this case there is no loss of capacity (as it happens for binar...
متن کاملOn Universal Ldpc Codes over Memoryless Symmetric Channels
A design of robust error-correcting codes that achieve reliable communication over various channels is of great theoretical and practical interest. Such codes are termed universal. This paper considers the universality of lowdensity parity-check (LDPC) code ensembles over families of memoryless binary-input output-symmetric (MBIOS) channels. Universality is considered both under belief-propagat...
متن کاملAnalysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group GL(m, F2) and the f...
متن کاملAn Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, ...
متن کاملAdaptive Viterbi decoding of convolutional codes over memoryless channels
In this paper, an adaptive decoding algorithm for convolutional codes, which is a modification of the Viterbi algorithm (VA) is presented. For a given code, the proposed algorithm yields nearly the same error performance as the VA while requiring a substantially smaller average number of computations. Unlike most of the other suboptimum algorithms, this algorithm is self-synchronizing. If the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2009
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2015992